Parametric properties of ideal semantics

Parametric Properties of Ideal Semantics

The concept of “ideal semantics” has been promoted as an alternative basis for skeptical reasoning within abstract argumentation settings. Informally, ideal acceptance not only requires an argument to be skeptically accepted in the traditional sense but further insists that the argument is in an admissible set all of whose arguments are also skeptically accepted. The original proposal was couch...

متن کامل

The computational complexity of ideal semantics

We analyse the computational complexity of the recently proposed ideal semantics within both abstract argumentation frameworks (AFs) and assumption-based argumentation frameworks (ABFs). It is shown that while typically less tractable than credulous admissibility semantics, the natural decision problems arising with this extension-based model can, perhaps surprisingly, be decided more efficient...

متن کامل

Formalization and logical properties of the Maximal Ideal Recursive Semantics for Weighted Defeasible Logic Programming

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming framework which combines features from argumentation theory and logic programming, in which defeasible rules are attached with weights expressing their relative belief or preference strength. In P-DeLP a conclusion succeeds if there exists an argument that entails the conclusion and this argument is found to be undefeate...

متن کامل

Formalization and logical properties of the Maximal Ideal Recursive Semantics for Weighted Defeasible Logic Programming

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming framework which combines features from argumentation theory and logic programming, in which defeasible rules are attached with weights expressing their relative belief or preference strength. In P-DeLP a conclusion succeeds if there exists an argument that entails the conclusion and this argument is found to be undefeate...

متن کامل

Formalization and logical properties of the Maximal Ideal Recursive Semantics for Weighted Defeasible Logic Programming

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming framework which combines features from argumentation theory and logic programming, in which defeasible rules are attached with weights expressing their relative belief or preference strength. In P-DeLP a conclusion succeeds if there exists an argument that entails the conclusion and this argument is found to be undefeate...

متن کامل

Parametric properties of ideal semantics

نویسندگان

چکیده

منابع مشابه